- expansion algorithm
- хвильовий алгоритм
English-Ukrainian dictionary of microelectronics. 2013.
expansion algorithm
Смотреть что такое "expansion algorithm" в других словарях:
Query expansion — (QE) is the process of reformulating a seed query to improve retrieval performance in information retrieval operations. [cite journal last = Vectomova | first = Olga | coauthors = Wang, Ying | year = 2006 title = A study of the effect of term… … Wikipedia
Greedy algorithm for Egyptian fractions — In mathematics, an Egyptian fraction is a representation of an irreducible fraction as a sum of unit fractions, as e.g. 5/6 = 1/2 + 1/3. As the name indicates, these representations have been used as long ago as ancient Egypt, but the first… … Wikipedia
Odd greedy expansion — In number theory, the odd greedy expansion problem concerns a method for forming Egyptian fractions in which all denominators are odd. If a rational number x/y is a sum of odd unit fractions, then y must be odd. Conversely, it is known that… … Wikipedia
Engel expansion — The Engel expansion of a positive real number x is the unique non decreasing sequence of positive integers {a 1,a 2,a 3,dots} such that:x=frac{1}{a 1}+frac{1}{a 1a 2}+frac{1}{a 1a 2a 3}+cdots.;Rational numbers have a finite Engel expansion, while … Wikipedia
Bresenham's line algorithm — The Bresenham line algorithm is an algorithm that determines which points in an n dimensional raster should be plotted in order to form a close approximation to a straight line between two given points. It is commonly used to draw lines on a… … Wikipedia
Spigot algorithm — A spigot algorithm is an algorithm used to compute the value of a mathematical constant such as pi; or e. Unlike recursive algorithms, a spigot algorithm yields digits incrementally without using previously computed digits. The Bailey Borwein… … Wikipedia
Constraint algorithm — In mechanics, a constraint algorithm is a method for satisfying constraints for bodies that obey Newton s equations of motion. There are three basic approaches to satisfying such constraints: choosing novel unconstrained coordinates ( internal… … Wikipedia
Integer relation algorithm — An integer relation between a set of real numbers x 1, x 2, ..., x n is a set of integers a 1, a 2, ..., a n, not all 0, such that:a 1x 1 + a 2x 2 + cdots + a nx n = 0.,An integer relation algorithm is an algorithm for finding integer relations.… … Wikipedia
Super-recursive algorithm — In computer science and computability theory, super recursive algorithms are algorithms that are more powerful, that is, compute more, than Turing machines. The term was introduced by Mark Burgin, whose book Super recursive algorithms develops… … Wikipedia
μ-law algorithm — Companding of μ law and A law algorithms The µ law algorithm (often u law, ulaw, or mu law) is a companding algorithm, primarily used in the digital telecommunication systems of North America and Japan. Companding algorithms reduce the dynamic… … Wikipedia
Μ-law algorithm — The µ law algorithm (pronounced myoo law) is a companding algorithm, primarily used in the digital telecommunication systems of North America and Japan. As with other companding algorithms, its purpose is to reduce the dynamic range of an audio… … Wikipedia
